The Widest Path Postoptimality Analysis
نویسندگان
چکیده
منابع مشابه
The widest ultracool binary
Aims. I test the ejection scenario of formation of brown dwarfs and very low-mass stars through the detection of a very wide ultracool binary. Methods. LEHPM 494 (M6.0 ± 1.0 V) and DENIS-P J0021.0–4244 (M9.5 ± 0.5 V) are separated by 1.3 arcmin and are high proper motion co-moving ultracool stars. I have used six astrometric epochs spaced 22 years to confirm their common tangential velocity. Re...
متن کاملOn the Complexity of Postoptimality Analysis of 0/1 Programs
In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear objective function. After an optimal solution has been determined for a given cost vector, one may want to know how much each cost coefficient can vary individually without affecting the optimality of the solution. W11e show that, under mild conditions, the existence of a polynomial method to calcul...
متن کاملComputing the Widest Empty Boomerang
In this paper we consider the following obnoxious facility location problem: given a set S of n points in the plane, and two special points a and b, find the 1-corner polygonal chain (also known as boomerang) connecting a and b such that its minimum distance to S is maximized. In other words: find the widest empty polygonal chain of two edges having extremes anchored at a and b. We present a ne...
متن کاملPostoptimality Analysis for Integer Programming Using Binary Decision Diagrams
We show how binary decision diagrams (BDDs) can be used to solve and obtain postoptimality analysis for linear and nonlinear integer programming problems with binary or general integer variables. The constraint set corresponds to a unique reduced BDD that represents all feasible or near-optimal solutions, and in which optimal solutions correspond to certain shortest paths. The BDD can be querie...
متن کاملTree decomposition and postoptimality analysis in discrete optimization
Many real discrete optimization problems (DOPs) are NP -hard and contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. Large DOPs can be solved due to their special structure using decomposition approaches. An important example of decomposition approaches is tree decomposition with local decomposition algorithms using the special...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Journal of Technology and Optimization
سال: 2017
ISSN: 2229-8711
DOI: 10.4172/2229-8711.1000214